Natural Deduction for Modal Logic with a Backtracking Operator

نویسنده

  • Jonathan Payne
چکیده

Harold Hodes in [1] introduces an extension of rst-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in terms of a reading of the backtracking operator whereby it serves to indicate modal scope. I prove soundness and completeness theorems with respect to Hodes’ semantics, as well as semantics with fewer restrictions on the accessibility relation (Hodes restricts his attention to S5).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint Deduction in an Interval-based Temporal Logic

In this paper, reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop are described. A constraint deduction approach is proposed and compared with a sequent calculus which has been developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.

متن کامل

Modal Deduction in Second-Order Logic and Set Theory - II

In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, deening a new set-theoretic function symbol for each new modal operator, we develop a general framework within which a number of extended modal logics can be dealt with. More precisely, we extend the basic set...

متن کامل

From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions

Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the structure of acyclic directed graphs with boxes. The boxes are used to restrict the scope of local assumptions. Proof nets for multiplicative exponential linear logic (MELL) are also graphs with boxes, but in MELL the boxes have the purpose of controlling the modal operator !. In this paper we study th...

متن کامل

Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural...

متن کامل

Automated Deduction for a Multi-Modal Logic of Time and Knowledge

Introduction and logical background Multimodal logics are an appropriate framework to represent agents, actions, time, knowledge... (see [8J, [9], [14], [18], [25] for some of its uses). For example Knowledge may be represented by means of the modal operator [K] and Time by [T]; and [K]p may be read as "p is known" and [T]p as "p will be true tomorrow". A typical modal formula is [K][T]p meanin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2015